A Mid -point Ellipse Drawing Algorithm on a Hexagonal Grid
نویسندگان
چکیده
In this paper, the idea of Mid-point ellipse drawing algorithm on a hexagonal grid is proposed. The performance of the proposed algorithm is compared to that of the conventional ellipse drawing algorithm on a square grid. The qualitative and execution time analysis proves that the proposed algorithm performs better than the conventional ellipse drawing algorithm on a square grid.
منابع مشابه
An Efficient Scan Conversion of Parabola on Hexagonal Grid
In this paper the midpoint approach for efficient scan conversion of parabola on hexagonal grid is proposed. The mid-point approach computes pixel nearest true curve using only integer arithmetic. The proposed algorithm is compared favorably with the existing parabola drawing algorithm on square grid. Owing to this approach we may visualize design ideas through animations and photorealistic ren...
متن کاملTree Drawings on the Hexagonal Grid
We consider straight-line drawings of trees on a hexagonal grid. The hexagonal grid is an extension of the common grid with inner nodes of degree six. We restrict the number of directions used for the edges from each node to its children from one to five, and to five patterns: straight, Y , ψ, X, and full. The ψ–drawings generalize hvor strictly upward drawings to ternary trees. We show that co...
متن کاملCorrector-predictor arc-search interior-point algorithm for $P_*(kappa)$-LCP acting in a wide neighborhood of the central path
In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...
متن کاملHexagonal Grid Drawings: Algorithms and Lower Bounds
We study drawings of graphs of maximum degree six on the hexagonal (triangular) grid, with the main focus of keeping the number of bends small. We give algorithms that achieve 3.5n + 3.5 bends for all simple graphs. We also prove optimal lower bounds on the number of bends for K7, and give asymptotic lower bounds for graph classes of varying connectivity.
متن کاملDynamic Replication based on Firefly Algorithm in Data Grid
In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed sy...
متن کامل